K-Medoid Algorithm in Clustering Student Scholarship Applicants
نویسندگان
چکیده
منابع مشابه
Effective Similarity Measure with Enhanced K-medoid Partitioned Clustering Algorithm
Now a days, it becomes more difficult for users to find the documents related to their interests, since the number of available web pages grows at large. Clustering is the method of grouping the data objects into classes or clusters so that data objects within a cluster have high similarity as compared to one another, but are very dissimilar to objects in other clusters. Such similarity measure...
متن کاملMACOC: A Medoid-Based ACO Clustering Algorithm
The application of ACO-based algorithms in data mining is growing over the last few years and several supervised and unsupervised learning algorithms have been developed using this bio-inspired approach. Most recent works concerning unsupervised learning have been focused on clustering, showing great potential of ACO-based techniques. This work presents an ACO-based clustering algorithm inspire...
متن کاملA Comprehensive usage of Enhanced K-Medoid Clustering Algorithm in Banking Sector
This paper is used to cluster the various components of a bank customer details and segregate potential customers eligible for loan. The application of this technique helps the banker to scale the potentiality of their customers and take necessary steps to decide for loan approval. The classic difficulty of recognizing the customer’s potentiality is solved using this thesis and helps them to ju...
متن کاملK-medoid-style Clustering Algorithms for Supervised Summary Generation
This paper centers on the discussion of k-medoid-style clustering algorithms for supervised summary generation. This task requires clustering techniques that identify class-uniform clusters. This paper investigates such a novel clustering technique we term supervised clustering. Our work focuses on the generalization of k-medoid-style clustering algorithms. We investigate two supervised cluster...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Journal of Informatics
سال: 2017
ISSN: 2460-0040,2407-7658
DOI: 10.15294/sji.v4i1.8212